Analysis and algorithms for partial protection in mesh networks

This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fraction q of each demand remains after any single link failure. A linear program is developed to find the minimum-cost capacity allocation to meet both demand and protection requirements. For q ≤ 1/2, an exact algorithmic solution for the optimal routing and allocation is developed using multiple shortest paths. For q >; 1/2, a heuristic algorithm based on disjoint path routing is developed that performs, on average, within 1.4% of optimal, and runs four orders of magnitude faster than the minimum-cost solution achieved via the linear program. Moreover, the partial protection strategies developed achieve reductions of up to 82% over traditional full protection schemes.National Science Foundation (U.S.) (NSF grant CNS-0626781)National Science Foundation (U.S.) (NSF grant CNS-0830961)United States. Defense Threat Reduction Agency (grant HDTRA1-07-1-0004)United States. Defense Threat Reduction Agency (grant HDTRA-09-1-005)United States. Air Force (Air Force contract #FA8721-05-C-0002

Network protection with multiple availability guarantees

We develop a novel network protection scheme that provides guarantees on both the fraction of time a flow has full connectivity, as well as a quantifiable minimum grade of service during downtimes. In particular, a flow can be below the full demand for at most a maximum fraction of time; then, it must still support at least a fraction q of the full demand. This is in contrast to current protection schemes that offer either availability-guarantees with no bandwidth guarantees during the downtime, or full protection schemes that offer 100% availability after a single link failure. We develop algorithms that provide multiple availability guarantees and show that significant capacity savings can be achieved as compared to full protection. If a connection is allowed to drop to 50% of its bandwidth for 1 out of every 20 failures, then a 24% reduction in spare capacity can be achieved over traditional full protection schemes. In addition, for the case of q = 0, corresponding to the standard availability constraint, an optimal pseudo-polynomial time algorithm is presented.National Science Foundation (U.S.) (NSF grants CNS-1116209)National Science Foundation (U.S.) (NSF grants CNS-0830961)United States. Defense Threat Reduction Agency (grant HDTRA-09-1-005)United States. Defense Threat Reduction Agency (grant HDTRA1-07-1-0004)United States. Air Force (Air Force contract # FA8721-05-C-0002

Advanced Telecommunications and Signal Processing Program

Contains an introduction and reports on eleven research projects.Advanced Telecommunications Research Progra

Advanced Television and Signal Processing Program

Contains an introduction and reports on two research projects.Advanced Television Research Progra

Advanced Television and Signal Processing Program

Contains an introduction and reports on fifteen research projects.Advanced Television Research ProgramAdams-Russell Electronics, Inc.National Science Foundation Fellowship Grant MIP 87-14969National Science Foundation FellowshipU.S. Navy - Office of Naval Research Grant N00014-89-J-1489U.S. Air Force - Electronic Systems Division Contract F1 9628-89-K-004

Information theoretic analysis of multiple-antenna transmission diversity

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.Includes bibliographical references (leaves 125-127).by Aradhana Narula.Ph.D

Information theoretic analysis of multiple-antenna transmission diversity

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.Cover title.Includes bibliographical references (p. 135-137).Supported by MIT Lincoln Laboratory.Aradhana Narula.Ph.D